Expansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains
نویسندگان
چکیده
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtraction-chain. The proposed algorithm is based on the small-window method, and reduces the number of windows by using subtractions. We show the proposed algorithm finds the shorter addition/subtraction-chain than what can be found by any other previous algorithm.
منابع مشابه
Finding Shorter Addition/Subtraction-Chains
Small Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtractionchain. The proposed algorithm...
متن کاملA Novel Approach to Background Subtraction Using Visual Saliency Map
Generally human vision system searches for salient regions and movements in video scenes to lessen the search space and effort. Using visual saliency map for modelling gives important information for understanding in many applications. In this paper we present a simple method with low computation load using visual saliency map for background subtraction in video stream. The proposed technique i...
متن کاملFDiBC: A Novel Fraud Detection Method in Bank Club based on Sliding Time and Scores Window
One of the recent strategies for increasing the customer’s loyalty in banking industry is the use of customers’ club system. In this system, customers receive scores on the basis of financial and club activities they are performing, and due to the achieved points, they get credits from the bank. In addition, by the advent of new technologies, fraud is growing in banking domain as well. Therefor...
متن کاملECM using Edwards curves
This paper introduces EECM-MPFQ, a fast implementation of the elliptic-curve method of factoring integers. EECM-MPFQ uses fewer modular multiplications than the well-known GMP-ECM software, takes less time than GMP-ECM, and finds more primes than GMP-ECM. The main improvements above the modular-arithmetic level are as follows: (1) use Edwards curves instead of Montgomery curves; (2) use extende...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 2 شماره
صفحات -
تاریخ انتشار 2006